Few-Sample Traffic Prediction With Graph Networks Using Locale as Relational Inductive Biases
نویسندگان
چکیده
Accurate short-term traffic prediction plays a pivotal role in various smart mobility operation and management systems. Currently, most of the state-of-the-art models are based on graph neural networks (Gnns), required training samples proportional to size network. In many cities, available amount data is substantially below minimum requirement due collection expense. It still an open question develop with small large-scale networks. We notice that states node for near future only depend its localized neighborhoods, which can be represented using relational inductive biases. view this, this paper develops network (Gn)-based deep learning model LocaleGn depicts dynamics aggregating updating functions, as well node-wise recurrent light-weighted designed few without over-fitting, hence it solve problem few-sample prediction. The proposed examined predicting both speed flow six datasets, experimental results demonstrate outperforms existing baseline models. also demonstrated learned knowledge from transferred across cities. research outcomes help systems, especially cities lacking historically archived data.
منابع مشابه
Learning Inductive Biases with Simple Neural Networks
People use rich prior knowledge about the world in order to efficiently learn new concepts. These priors–also known as “inductive biases”–pertain to the space of internal models considered by a learner, and they help the learner make inferences that go beyond the observed data. A recent study found that deep neural networks optimized for object recognition develop the shape bias (Ritter et al.,...
متن کاملFew-Shot Learning with Graph Neural Networks
We propose to study the problem of few-shot learning with the prism of inference on a partially observed graphical model, constructed from a collection of input images whose label can be either observed or not. By assimilating generic message-passing inference algorithms with their neural-network counterparts, we define a graph neural network architecture that generalizes several of the recentl...
متن کاملModeling Relational Data with Graph Convolutional Networks
Knowledge bases play a crucial role in many applications, for example question answering and information retrieval. Despite the great effort invested in creating and maintaining them, even the largest representatives (e.g., Yago, DBPedia or Wikidata) are highly incomplete. We introduce relational graph convolutional networks (R-GCNs) and apply them to two standard knowledge base completion task...
متن کاملProtein Interface Prediction using Graph Convolutional Networks
We consider the prediction of interfaces between proteins, a challenging problem with important applications in drug discovery and design, and examine the performance of existing and newly proposed spatial graph convolution operators for this task. By performing convolution over a local neighborhood of a node of interest, we are able to stack multiple layers of convolution and learn effective l...
متن کاملA Few Graph-Based Relational Numerical Abstract Domains
This article presents the systematic design of a class of relational numerical abstract domains from non-relational ones. Constructed domains represent sets of invariants of the form (vj − vi ∈ C), where vj and vi are two variables, and C lives in an abstraction of P(Z), P(Q), or P(R). We will call this family of domains weakly relational domains. The underlying concept allowing this constructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2022
ISSN: ['1558-0016', '1524-9050']
DOI: https://doi.org/10.1109/tits.2022.3219618